A compositional approach to probabilistic knowledge compilation

نویسندگان

چکیده

Bayesian networks (BN) are a popular representation for reasoning under uncertainty. The analysis of many real-world use cases, that in principle can be modeled by BNs, suffers however from the computational complexity inference. Inference methods based on Weighted Model Counting (WMC) reduce cost inference exploiting patterns exhibited probabilities associated with BN nodes. However, these require computationally intensive compilation step search patterns, which effectively prohibits handling larger BNs. In this paper, we propose solution to problem extending WMC framework called Compositional (CWMC). CWMC reduces partitioning into set subproblems, thereby scaling application state-of-the-art innovations scenarios where could previously not amortized over cost. supports various target representations less or equally succinct as decision-DNNF. At same time, its time O(nexp⁡(w)), n is number variables and w tree-width, comparable mainstream algorithms variable elimination, clustering conditioning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing the Cost of Probabilistic Knowledge Compilation

Bayesian networks (BN) are a popular representation for reasoning under uncertainty. The computational complexity of inference, however, hinders its applicability to many real-world domains that in principle can be modeled by BNs. Inference methods based on Weighted Model Counting (WMC) reduce the cost of inference by exploiting patterns exhibited by the probabilities associated with BN nodes. ...

متن کامل

Aggregation in Probabilistic Databases via Knowledge Compilation

This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic structures of semiring and semimodule. The core of our evaluation technique is a procedure that compiles semimodule and semiring expressions into so-called decomposition trees, for which the computation of the probabili...

متن کامل

A Probabilistic Approach to Knowledge Translation

In this paper, we focus on a novel knowledge reuse scenario where the knowledge in the source schema needs to be translated to a semantically heterogeneous target schema. We refer to this task as “knowledge translation” (KT). Unlike data translation and transfer learning, KT does not require any data from the source or target schema. We adopt a probabilistic approach to KT by representing the k...

متن کامل

Strategic knowledge in design: a compositional approach

In interactive design processes, strategic decisions are made at different levels. To support designers, design support systems need to include corresponding strategic knowledge at these levels. In this paper three levels of strategic interaction and strategic knowledge are identified within a compositional model of design. These levels are identified in reasoning about the manipulation of requ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2021

ISSN: ['1873-4731', '0888-613X']

DOI: https://doi.org/10.1016/j.ijar.2021.07.007